Linear time approximation schemes for vehicle scheduling problems
نویسندگان
چکیده
منابع مشابه
Linear-Time Approximation Schemes for Clustering Problems
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our approach leads to simple randomized algorithms for the k-means, k-median and discrete k-means problems that yield (1 + ε) approximations with probability ≥ 1/2 and running times of O(2(k/ε)O(1)dn). These are the first algor...
متن کاملPolynomial-time approximation schemes for scheduling problems with time lags
We identify two classes of machine scheduling problems with time lags that possess Polynomial-Time Approximation Schemes (PTASs). These classes together, one for minimizing makespan and one for minimizing total completion time, include many well-studied time lag scheduling problems. The running times of these approximation schemes are polynomial in the number of jobs, but exponential in the num...
متن کاملNear-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems
We consider several implicit fractional packing problems and obtain faster implementations of approximation schemes based on multiplicative-weight updates. This leads to new algorithms with near-linear running times for some fundamental problems in combinatorial optimization. We highlight two concrete applications. The first is to find the maximum fractional packing of spanning trees in a capac...
متن کاملNearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric Problems
We present a randomized polynomial time approximation scheme for Euclidean TSP in < 2 that is substantially more eecient than our earlier scheme in 2] (and the scheme of Mitchell 21]). For any xed c > 1 and any set of n nodes in the plane, the new scheme nds a (1+ 1 c)-approximation to the optimum traveling salesman tour in O(n(log n) O(c)) time. (Our earlier scheme ran in n O(c) time.) For poi...
متن کاملNear Linear Time Approximation Schemes for Uncapacitated and Capacitated b-Matching Problems in Nonbipartite Graphs
We present the first fully polynomial approximation schemes for the maximum weighted (uncapacitated or capacitated) b–Matching problems for nonbipartite graphs that run in time (near) linear in the number of edges, that is, given any constant δ > 0 the algorithm produces a (1 − δ) approximation in O(mpoly(δ−1, logn)) time. We provide fractional solutions for the standard linear programming form...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.05.013